An algorithm for the maximum weight independent set problem on outerstring graphs
نویسندگان
چکیده
منابع مشابه
A Polynomial time Algorithm for the Maximum Weight Independent Set Problem on Outerstring Graphs∗
Outerstring graphs are the intersection graphs of curves that lie inside a disk such that each curve intersects the boundary of the disk in one of its endpoints. Outerstring graphs were introduced in 1991 and are amongst the most general classes of intersection graphs studied, including among others, chordal graphs and interval filament graphs. To date no polynomial time algorithm is known for ...
متن کاملAn Algorithm for the Maximum Weight Independent Set Problem onOutersting Graphs
Outerstring graphs are the intersection graphs of curves that lie inside a disk such that each curve intersects the boundary of the disk. Outerstring graphs are among the most general classes of intersection graphs studied. To date, no polynomial time algorithm is known for any of the classical graph optimization problems on outerstring graphs; in fact, most are NP-hard. It is known that there ...
متن کاملAn Optimal Algorithm to Find Maximum Independent Set and Maximum 2-Independent Set on Cactus Graphs
A cactus graph is a connected graph in which every block is either an edge or a cycle. An optimal algorithm is presented here to find a maximum independent set and maximum 2-independent set on cactus graphs in O(n) time, where n is the total number of vertices of the graph. The cactus graph has many applications in real life problems, specially in radio communication system.
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولThe maximum independent set problem on layered graphs
The independent set on a graph G = (V, E) is a subset of V such that no two vertices in the subset have an edge between them. The maximum independent set problem on G seeks to identify an independent set with maximum cardinality, i.e. maximum independent set or MIS. The maximum independent set problem on a general graph is known to be NP-complete. On certain classes of graphs MIS can be compute...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2016.05.001